Independent Spanning Trees of Extended Chordal Rings
نویسنده
چکیده
A graphG = (V,E) is called a chordal ring and denoted by CR(N, d), if V = {0, 1, · · · , N− 1} and E = {(u, v) | [v − u]N = 1 or [v − u]N = d, 2 ≦ d ≦ N/2)}, where [v − u]N denotes v − u modulo N . A graph G = (V,E) is called an extended chordal ring and denoted by CR(N, d1, d2), if V = {0, 1, · · · , N − 1} and E = {(u, v) | [v − u]N = 1 or [v − u]N = di, 1 ≦ i ≦ 2, 2 ≦ di ≦ N/2)}. CR(N, d1, N/2) is 5-connected ifN is even. We give an algorithm to construct 5 independent spanning trees of CR(N, d1, N/2), N is even and 2 ≦ d1 ≦ ⌈N/4⌉.
منابع مشابه
Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract)
In this paper we show that, for each chordal graph G, there is a tree T such that T is a spanning tree of the square G2 of G and, for every two vertices, the distance between them in T is not larger than the distance in G plus 2. Moreover, we prove that, if G is a strongly chordal graph or even a dually chordal graph, then there exists a spanning tree T of G that is an additive 3-spanner as wel...
متن کاملChronological Studies of Traffic Pollution Using Elemental Analysis of Tree Rings: Case Study of Haatso-atomic Road
Mitigation of atmospheric pollution has been a topic of concern over the past decades. In this study, tree rings have been used to reconstruct past climates as well as to assess the effects of recent climatic and environmental changes on tree growth. Vehicular emission is one of the major sources of pollutants in the atmosphere and this study focused on the Haatso-Atomic road which over the yea...
متن کاملChronological Studies of Traffic Pollution Using Elemental Analysis of Tree Rings: Case Study of Haatso-atomic Road
Mitigation of atmospheric pollution has been a topic of concern over the past decades. In this study, tree rings have been used to reconstruct past climates as well as to assess the effects of recent climatic and environmental changes on tree growth. Vehicular emission is one of the major sources of pollutants in the atmosphere and this study focused on the Haatso-Atomic road which over the yea...
متن کاملDetermining possible sets of leaves for spanning trees of dually chordal graphs
It will be proved that the problem of determining whether a set of vertices of a dually chordal graphs is the set of leaves of a tree compatible with it can be solved in polynomial time by establishing a connection with finding clique trees of chordal graphs with minimum number of leaves.
متن کاملComplement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کامل